Embedding complete trees into the hypercube
نویسندگان
چکیده
منابع مشابه
Embedding complete trees into the hypercube
We consider embeddings of the complete t-ary trees of depth k (denotation T k,t) as subgraphs into the hypercube of minimum dimension n. This n, denoted by dim(T k,t), is known if max{k, t} ≤ 2. First we study the next open case max{k, t} = 3. We improve the known upper bound dim(T k,3) ≤ 2k + 1 up to limk→∞ dim(T k,3)/k ≤ 5/3 and derive the asymptotic limt→∞ dim(T 3,t)/t = 227/120. As a co-res...
متن کاملEmbedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کاملEmbedding Starlike Trees into Hypercube-Like Interconnection Networks
A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-like interconnection networks called restricted HLgraphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes. We show in this paper that every starlike tree of degree at most m with...
متن کاملEmbedding complete ternary trees into hypercubes
We inductively describe an embedding of a complete ternary tree Th of height h into a hypercube Q of dimension at most d(1.6)he + 1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Th into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Th into its optimal hypercube...
متن کاملEmbedding Complete Binary Trees into Butterfly Networks
In this paper we present embeddings of complete binary trees into butterfly networks with or without wrap-around connections. Let m be an even integer and q = m+ LlogmJ-l. We show how to embed a 2+I -I-node complete binary tree T(q) into a (m + 1)2111+1_ node wrap-around butterfly B1l1(m +1) with a dilation of 4, and how to embed T(q) into a (m + 2)2+_node wrap-around butterfly B 1l1 (m +2) wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00256-0